Density of Binary Disc Packings: The Nine Compact Packings
نویسندگان
چکیده
A disc packing in the plane is compact if its contact graph a triangulation. There are nine values of r such that by discs radii 1 and exists. For each these values, we prove maximal density over all packings reached for packing. We describe give density.
منابع مشابه
Periodic planar disc packings.
Several conditions are given when a packing of equal discs in a torus is locally maximally dense, where the torus is defined as the quotient of the plane by a two-dimensional lattice. Conjectures are presented that claim that the density of any collectively jammed packing, whose graph does not consist of all triangles, and the torus lattice is the standard triangular lattice, is at most (n/(n +...
متن کاملDensest binary sphere packings.
The densest binary sphere packings in the α-x plane of small to large sphere radius ratio α and small sphere relative concentration x have historically been very difficult to determine. Previous research had led to the prediction that these packings were composed of a few known "alloy" phases including, for example, the AlB(2) (hexagonal ω), HgBr(2), and AuTe(2) structures, and to XY(n) structu...
متن کاملCircle Packings in the Unit Disc
A Bl-packing is a (branched) circle packing that “properly covers” the unit disc. We establish some fundamental properties of such packings. We give necessary and sufficient conditions for their existence, prove their uniqueness, and show that their underlying surfaces, known as carriers, are quasiconformally equivalent to surfaces of classical Blaschke products. We also extend the approximatio...
متن کاملConfined disordered strictly jammed binary sphere packings.
Disordered jammed packings under confinement have received considerably less attention than their bulk counterparts and yet arise in a variety of practical situations. In this work, we study binary sphere packings that are confined between two parallel hard planes and generalize the Torquato-Jiao (TJ) sequential linear programming algorithm [Phys. Rev. E 82, 061302 (2010)] to obtain putative ma...
متن کاملGeneration of Optimal Packings from Optimal Packings
We define two notions of generation between the various optimal packings Qm of m congruent disks in a subset K of R2. The first one that we call weak generation consists in getting Qn by removing m − n disks from Qm and by displacing the n remaining congruent disks which grow continuously and do not overlap. During a weak generation of Qn from Qm, we consider the contact graphs G(t) of the inte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2022
ISSN: ['1432-0444', '0179-5376']
DOI: https://doi.org/10.1007/s00454-021-00348-7